منابع مشابه
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
This paper studies how to optimally embed a general metric, represented by a graph, into a target space while preserving the relative magnitudes of most distances. More precisely, in an ordinal embedding, we must preserve the relative order between pairs of distances (which pairs are larger or smaller), and not necessarily the values of the distances themselves. The relaxation of an ordinal emb...
متن کاملPumping for ordinal-automatic structures
An α-automaton (for α some ordinal) is an automaton similar to a Muller automaton that processes words of length α. A structure is called α-automatic if it can be presented by α-automata (completely analogous to the notion of automatic structures which can be presented by the well-known finite automata). We call a structure ordinal-automatic if it is α-automatic for some ordinal α. We continue ...
متن کاملOrdinal Arithmetic with List Structures
We provide a set of \natural" requirements for well-orderings of (binary) list structures. We show that the resultant order-type is the successor of the rst critical epsilon number. The checker has to verify that the process comes to an end. Here again he should be assisted by the programmer giving a further de nite assertion to be veri ed. This may take the form of a quantity which is asserted...
متن کاملContinuous dimensionality characterization of image structures
Intrinsic dimensionality is a concept introduced by statistics and later used in image processing to measure the dimensionality of a data set. In this paper, we introduce a continuous representation of the intrinsic dimension of an image patch in terms of its local spectrum or, equivalently, its gradient field. By making use of a cone structure and barycentric co-ordinates, we can associate thr...
متن کاملOrdinal Arithmetic with List Structures (Preliminary Version)
The checker has to verify that the process comes to an end. Here again he should be assisted by the programmer giving a further definite assertion to be verified. This may take the form of a quantity which is asserted to decrease continually and vanish when the machine stops. To the pure mathematician it is natural to give an ordinal number. In this problem the ordinal might be (n r)w 2 + (r s)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00289-u